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:01Dominique GarmierDominique GarmierScore: 7,365Success
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:017,24077,689,54758,055,0002,037,0002,441,216
2Apr 24, 2026 08:017,24179,823,29757,099,0003,005,0002,342,912
3Apr 24, 2026 08:017,30475,698,00257,647,0002,981,0002,433,024
4Apr 24, 2026 08:017,36082,861,91258,088,0003,004,0002,437,120
5Apr 24, 2026 08:017,36576,942,16358,125,0003,006,0002,437,120
6Apr 24, 2026 08:017,39884,311,65459,391,0002,013,0002,441,216
7Apr 24, 2026 08:017,40281,151,39659,423,0002,014,0002,441,216
8Apr 24, 2026 08:017,40682,225,78459,461,0002,015,0002,433,024
9Apr 24, 2026 08:017,40780,601,17760,473,0001,007,0002,449,408