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 21, 2026 13:06Victor MerckléVictor MerckléScore: 4,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 13:074,64546,498,18037,497,0001,057,0002,113,536
2May 21, 2026 13:074,64748,053,91537,499,0001,074,0002,113,536
3May 21, 2026 13:074,65846,679,40337,657,0001,007,0002,113,536
4May 21, 2026 13:074,66348,233,41837,705,0001,004,0002,113,536
5May 21, 2026 13:074,66446,621,21737,712,0001,003,0002,113,536
6May 21, 2026 13:074,68449,926,12237,818,0001,061,0002,113,536
7May 21, 2026 13:074,70848,632,59938,025,0001,056,0002,113,536
8May 21, 2026 13:074,71748,863,20338,152,0001,002,0002,113,536
9May 21, 2026 13:074,73047,068,57638,209,0001,057,0002,113,536