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 5, 2026 19:27Kevin HeaveyKevin HeaveyScore: 5,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 19:275,78157,493,51643,225,0004,760,0002,117,632
2Jul 5, 2026 19:275,79357,715,99243,237,0004,847,0002,117,632
3Jul 5, 2026 19:275,79858,203,40643,088,0005,038,0002,117,632
4Jul 5, 2026 19:275,81357,891,70143,404,0004,847,0002,117,632
5Jul 5, 2026 19:275,81357,793,55543,246,0005,007,0002,117,632
6Jul 5, 2026 19:275,82557,940,02343,278,0005,073,0002,117,632
7Jul 5, 2026 19:275,84158,088,35543,662,0004,821,0002,117,632
8Jul 5, 2026 19:275,84258,146,41743,316,0005,175,0002,117,632
9Jul 5, 2026 19:275,86458,202,77343,743,0004,933,0002,117,632