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 11, 2026 03:48Josu 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 11, 2026 03:49042,425,23231,950,0001,091,0002,113,536expected "53686464076293392 ", got "53686463820293392 "
2May 11, 2026 03:493,85841,955,54830,936,0001,089,0002,113,536
3May 11, 2026 03:493,86340,032,13931,004,0001,063,0002,113,536
4May 11, 2026 03:493,87239,730,67131,053,0001,090,0002,113,536
5May 11, 2026 03:493,89041,842,79631,207,0001,084,0002,113,536
6May 11, 2026 03:493,89540,620,96431,264,0001,068,0002,113,536
7May 11, 2026 03:493,89939,880,47531,278,0001,091,0002,113,536
8May 11, 2026 03:493,91142,440,27831,390,0001,074,0002,113,536
9May 11, 2026 03:493,91741,781,42031,451,0001,064,0002,113,536