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 06:57Josu San MartinJosu San MartinError
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 06:57050,324,50533,254,0001,179,0002,490,368expected "53680045668260677 ", got "53680045555829211 "
2May 10, 2026 06:574,11751,058,71933,062,0001,116,0002,494,464
3May 10, 2026 06:574,13052,327,64333,177,0001,107,0002,490,368
4May 10, 2026 06:574,13651,955,71833,195,0001,142,0002,482,176
5May 10, 2026 06:574,14651,358,98733,382,0001,033,0002,490,368
6May 10, 2026 06:574,14951,116,28333,313,0001,126,0002,482,176
7May 10, 2026 06:574,15152,870,75033,315,0001,143,0002,494,464
8May 10, 2026 06:574,15250,795,58533,354,0001,113,0002,498,560
9May 10, 2026 06:574,16948,896,96133,462,0001,141,0002,482,176