Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 13, 2026 22:56Jarry XiaoJarry XiaoScore: 11,971Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2026 22:5711,963108,938,40598,286,0001,014,0002,117,632
2Jul 13, 2026 22:5711,963108,907,86098,286,0001,014,0002,117,632
3Jul 13, 2026 22:5711,967108,950,84998,317,0001,016,0002,117,632
4Jul 13, 2026 22:5711,969109,012,57298,338,0001,011,0002,117,632
5Jul 13, 2026 22:5711,971108,984,43598,348,0001,014,0002,117,632
6Jul 13, 2026 22:5711,978109,064,88598,411,0001,011,0002,117,632
7Jul 13, 2026 22:5711,979109,021,78098,419,0001,013,0002,117,632
8Jul 13, 2026 22:5712,013109,441,57098,699,0001,014,0002,117,632
9Jul 13, 2026 22:5712,019111,289,13697,639,0002,121,0002,117,632