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 27, 2026 10:23wnwnScore: 3,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:243,45945,022,26627,692,0001,025,0002,482,176
2Apr 27, 2026 10:243,56249,547,47328,551,0001,019,0002,478,080
3Apr 27, 2026 10:243,58542,942,11927,773,0001,983,0002,490,368
4Apr 27, 2026 10:243,59851,244,94827,875,0001,991,0002,490,368
5Apr 27, 2026 10:243,61347,323,79727,991,0001,999,0002,478,080
6Apr 27, 2026 10:243,61748,682,50228,025,0002,001,0002,486,272
7Apr 27, 2026 10:243,62347,360,91928,068,0002,004,0002,486,272
8Apr 27, 2026 10:243,63645,770,70229,181,0001,006,0002,486,272
9Apr 27, 2026 10:243,64848,105,65629,274,0001,009,0002,314,240