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 listJun 10, 2026 11:20Victor MerckléVictor MerckléScore: 4,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 11:224,92748,496,14439,844,0001,058,0002,113,536
2Jun 10, 2026 11:224,93248,551,81639,909,0001,028,0002,113,536
3Jun 10, 2026 11:224,93248,505,08739,912,0001,031,0002,113,536
4Jun 10, 2026 11:224,93848,599,65439,915,0001,078,0002,113,536
5Jun 10, 2026 11:224,97048,840,48340,254,0001,001,0002,113,536
6Jun 10, 2026 11:225,11650,056,25241,423,0001,043,0002,113,536
7Jun 10, 2026 11:225,16050,386,25841,811,0001,025,0002,113,536
8Jun 10, 2026 11:225,24351,103,60142,439,0001,081,0002,113,536
9Jun 10, 2026 11:225,25051,186,06242,528,0001,053,0002,113,536