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 listMay 20, 2026 05:38M-RochatM-RochatScore: 13,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:3813,447123,043,018109,591,0002,020,0002,113,536
2May 20, 2026 05:3813,450121,700,507109,438,0002,198,0002,113,536
3May 20, 2026 05:3813,454122,884,314109,447,0002,222,0002,113,536
4May 20, 2026 05:3813,458123,246,120109,688,0002,018,0002,113,536
5May 20, 2026 05:3813,463121,478,729109,732,0002,019,0002,113,536
6May 20, 2026 05:3813,473121,220,052109,631,0002,200,0002,113,536
7May 20, 2026 05:3813,492123,044,067109,776,0002,214,0002,113,536
8May 20, 2026 05:3813,520124,334,670110,168,0002,051,0002,113,536
9May 20, 2026 05:3813,535134,855,296110,106,0002,236,0002,113,536