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 listMay 10, 2026 05:19Josu San MartinJosu San MartinScore: 4,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 05:194,10852,600,64532,976,0001,121,0002,490,368
2May 10, 2026 05:194,12252,078,69233,085,0001,133,0002,478,080
3May 10, 2026 05:194,12450,903,59933,157,0001,078,0002,482,176
4May 10, 2026 05:194,12552,521,27833,130,0001,115,0002,473,984
5May 10, 2026 05:194,13850,097,81233,293,0001,058,0002,478,080
6May 10, 2026 05:194,14051,494,58333,291,0001,075,0002,482,176
7May 10, 2026 05:194,14250,765,90033,350,0001,031,0002,490,368
8May 10, 2026 05:194,14447,690,78333,372,0001,029,0002,478,080
9May 10, 2026 05:194,15448,645,74633,374,0001,111,0002,490,368