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 10, 2026 18:53Lan Hoang DaoLan Hoang DaoScore: 102,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 18:53102,316859,985,895789,990,00059,235,0002,113,536
2Aug 10, 2026 18:53102,357859,522,259791,513,00058,052,0002,113,536
3Aug 10, 2026 18:53102,548861,209,314793,006,00058,149,0002,113,536
4Aug 10, 2026 18:53102,561862,133,175793,450,00057,810,0002,113,536
5Aug 10, 2026 18:53102,567862,567,176793,415,00057,896,0002,113,536
6Aug 10, 2026 18:53102,612862,324,565792,367,00059,315,0002,113,536
7Aug 10, 2026 18:53102,617861,726,926793,494,00058,232,0002,113,536
8Aug 10, 2026 18:53102,728862,674,987794,632,00058,012,0002,113,536
9Aug 10, 2026 18:53102,783863,200,794794,543,00058,561,0002,113,536