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 4, 2026 22:50zielajzielajScore: 3,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2026 22:513,43751,173,55427,511,0001,018,0002,433,024
2Apr 4, 2026 22:503,45453,974,69927,645,0001,023,0002,424,832
3Apr 4, 2026 22:513,45756,568,40927,668,0001,024,0002,519,040
4Apr 4, 2026 22:503,52451,986,38527,230,0002,017,0002,437,120
5Apr 4, 2026 22:503,64851,397,32129,271,0001,009,0002,510,848
6Apr 4, 2026 22:513,67752,832,45729,502,0001,017,0002,437,120