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 30, 2026 19:44Josu San MartinJosu San MartinScore: 4,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:444,29344,031,14134,581,0001,053,0002,113,536
2Aug 30, 2026 19:444,29944,195,54834,570,0001,115,0002,113,536
3Aug 30, 2026 19:444,30744,163,78034,702,0001,053,0002,113,536
4Aug 30, 2026 19:444,30844,224,56034,698,0001,064,0002,113,536
5Aug 30, 2026 19:444,31044,379,14434,766,0001,015,0002,113,536
6Aug 30, 2026 19:444,31244,160,05934,742,0001,052,0002,113,536
7Aug 30, 2026 19:444,32044,407,43534,762,0001,099,0002,113,536
8Aug 30, 2026 19:444,32544,363,13934,846,0001,054,0002,113,536
9Aug 30, 2026 19:444,44045,355,60635,824,0001,035,0002,113,536