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:43M-RochatM-RochatScore: 12,488Success
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:4412,455115,849,268101,046,0002,334,0002,113,536
2May 20, 2026 05:4412,460114,425,848101,094,0002,330,0002,113,536
3May 20, 2026 05:4412,470112,970,517101,171,0002,334,0002,113,536
4May 20, 2026 05:4412,486115,059,213101,311,0002,324,0002,113,536
5May 20, 2026 05:4412,488116,077,359101,306,0002,346,0002,113,536
6May 20, 2026 05:4412,495114,226,961101,664,0002,046,0002,113,536
7May 20, 2026 05:4412,499116,089,072101,704,0002,043,0002,113,536
8May 20, 2026 05:4412,506115,139,353101,760,0002,040,0002,113,536
9May 20, 2026 05:4412,520114,899,425101,818,0002,105,0002,113,536