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 9, 2026 22:40Josu San MartinJosu San MartinScore: 5,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 22:414,93556,136,53039,924,0001,038,0002,535,424
2May 9, 2026 22:414,95957,778,57740,128,0001,039,0002,539,520
3May 9, 2026 22:414,98859,590,39640,362,0001,045,0002,510,848
4May 9, 2026 22:415,02157,612,79440,643,0001,038,0002,519,040
5May 9, 2026 22:415,04460,330,54940,844,0001,029,0002,519,040
6May 9, 2026 22:415,08256,100,95341,145,0001,040,0002,519,040
7May 9, 2026 22:415,10457,258,69841,343,0001,026,0002,523,136
8May 9, 2026 22:415,28362,197,03042,821,0001,028,0002,506,752
9May 9, 2026 22:415,43559,291,68844,092,0001,026,0002,498,560