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 24, 2026 08:14Dominique GarmierDominique GarmierScore: 6,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:156,82878,312,53454,650,0002,024,0002,347,008
2Apr 24, 2026 08:156,84377,094,43654,769,0002,028,0002,355,200
3Apr 24, 2026 08:156,86076,378,26453,949,0002,997,0002,347,008
4Apr 24, 2026 08:156,86173,667,06953,951,0002,997,0002,347,008
5Apr 24, 2026 08:156,86974,256,73954,016,0003,000,0002,342,912
6Apr 24, 2026 08:156,91576,876,60454,381,0003,021,0002,351,104
7Apr 24, 2026 08:156,92474,029,04455,455,0002,016,0002,355,200
8Apr 24, 2026 08:156,92779,131,76855,484,0002,017,0002,355,200
9Apr 24, 2026 08:156,97376,641,61654,884,0002,993,0002,347,008