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 listJul 13, 2026 17:14boop34boop34Score: 27,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2026 17:1526,565230,843,664219,486,0001,008,0002,113,536
2Jul 13, 2026 17:1526,568230,295,335219,506,0001,010,0002,113,536
3Jul 13, 2026 17:1526,683231,336,844219,450,0002,020,0002,113,536
4Jul 13, 2026 17:1527,077235,991,418223,733,0001,008,0002,113,536
5Jul 13, 2026 17:1527,107235,261,999223,982,0001,009,0002,113,536
6Jul 13, 2026 17:1527,110235,446,058223,009,0002,011,0002,113,536
7Jul 13, 2026 17:1527,113235,301,489223,033,0002,011,0002,113,536
8Jul 13, 2026 17:1527,145235,635,481223,250,0002,056,0002,113,536
9Jul 13, 2026 17:1527,148235,740,459223,259,0002,072,0002,113,536