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 10:37M-RochatM-RochatScore: 6,843Success
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 10:386,73365,542,96953,832,0002,059,0002,113,536
2May 20, 2026 10:386,75265,491,72253,983,0002,064,0002,113,536
3May 20, 2026 10:386,75765,541,38954,023,0002,067,0002,113,536
4May 20, 2026 10:386,83468,972,57854,669,0002,055,0002,113,536
5May 20, 2026 10:386,84368,433,54254,650,0002,152,0002,113,536
6May 20, 2026 10:386,84466,735,86054,642,0002,166,0002,113,536
7May 20, 2026 10:386,86067,529,38354,770,0002,168,0002,113,536
8May 20, 2026 10:386,87667,432,41254,885,0002,194,0002,117,632
9May 20, 2026 10:386,87766,554,99054,917,0002,167,0002,113,536