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 listApr 20, 2026 22:19Josu San MartinJosu San MartinScore: 5,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 22:205,16364,490,76640,861,0001,993,0002,379,776
2Apr 20, 2026 22:205,19965,171,02641,151,0002,007,0002,387,968
3Apr 20, 2026 22:205,22067,501,06142,322,0001,007,0002,371,584
4Apr 20, 2026 22:205,27668,142,49941,807,0001,990,0002,371,584
5Apr 20, 2026 22:205,30164,742,63142,005,0002,000,0002,375,680
6Apr 20, 2026 22:205,31157,179,44142,082,0002,003,0002,277,376
7Apr 20, 2026 22:205,31665,233,55142,121,0002,005,0002,387,968
8Apr 20, 2026 22:205,45058,024,31343,230,0002,010,0002,277,376
9Apr 20, 2026 22:205,54168,710,87743,997,0001,999,0002,379,776