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 18, 2026 18:27Lan Hoang DaoLan Hoang DaoScore: 86,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 18:2886,807731,326,535662,356,00058,144,0002,113,536
2Aug 18, 2026 18:2886,885732,007,195662,453,00058,698,0002,113,536
3Aug 18, 2026 18:2886,961731,705,275663,694,00058,088,0002,113,536
4Aug 18, 2026 18:2886,968732,500,035662,826,00059,015,0002,113,536
5Aug 18, 2026 18:2886,988732,075,338663,722,00058,283,0002,113,536
6Aug 18, 2026 18:2886,989731,995,090663,668,00058,347,0002,113,536
7Aug 18, 2026 18:2887,006734,117,053663,617,00058,540,0002,113,536
8Aug 18, 2026 18:2893,873789,255,203719,335,00059,816,0002,113,536
9Aug 18, 2026 18:2894,383793,456,795724,775,00058,611,0002,113,536