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 listAug 1, 2026 13:00George SeabridgeGeorge SeabridgeScore: 7,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 13:006,81566,552,39855,561,0001,010,0002,113,536
2Aug 1, 2026 13:006,81966,561,90955,521,0001,079,0002,113,536
3Aug 1, 2026 13:006,82266,610,85955,532,0001,091,0002,113,536
4Aug 1, 2026 13:006,87466,995,94655,978,0001,077,0002,113,536
5Aug 1, 2026 13:007,45872,710,56360,830,0001,077,0002,113,536
6Aug 1, 2026 13:008,13477,499,78666,419,0001,100,0002,113,536
7Aug 1, 2026 13:008,15077,599,15666,562,0001,084,0002,113,536
8Aug 1, 2026 13:008,17377,820,04466,749,0001,091,0002,113,536
9Aug 1, 2026 13:008,17677,921,86666,624,0001,241,0002,113,536