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 26, 2026 13:40TudyMTudyMScore: 59,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 13:4059,002512,525,491486,724,0002,998,0002,379,776
2Apr 26, 2026 13:4059,005503,431,981487,749,0001,998,0002,359,296
3Apr 26, 2026 13:4059,006510,399,852487,756,0001,999,0002,371,584
4Apr 26, 2026 13:4059,009509,709,119487,782,0001,999,0002,293,760
5Apr 26, 2026 13:4059,011503,814,845485,796,0003,998,0002,301,952
6Apr 26, 2026 13:4059,012507,819,856487,801,0001,999,0002,359,296
7Apr 26, 2026 13:4059,020505,589,526487,872,0001,999,0002,433,024
8Apr 26, 2026 13:4059,028507,517,691487,938,0001,999,0002,363,392
9Apr 26, 2026 13:4059,033505,287,761487,981,0001,999,0002,433,024