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 13, 2026 04:22wnwnScore: 4,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 06:014,28859,831,22734,574,0001,016,0002,535,424
2Apr 13, 2026 06:064,29462,456,33534,621,0001,018,0002,277,376
3Apr 13, 2026 06:064,31662,908,28333,834,0001,990,0002,277,376
4Apr 13, 2026 04:224,31864,613,58633,852,0001,991,0002,277,376
5Apr 13, 2026 06:014,32765,648,17433,917,0001,995,0002,277,376
6Apr 13, 2026 04:224,34556,343,63034,062,0002,003,0002,277,376
7Apr 13, 2026 06:064,39557,411,14735,462,0001,013,0002,277,376
8Apr 13, 2026 04:224,39655,496,62735,475,0001,013,0002,277,376
9Apr 13, 2026 06:014,44356,262,95134,880,0001,993,0002,535,424