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 4, 2026 00:05Josu San MartinJosu San MartinScore: 15,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:0515,472138,012,68163,029,00065,390,0002,113,536
2Jul 4, 2026 00:0515,585138,914,12463,906,00065,450,0002,113,536
3Jul 4, 2026 00:0515,602138,896,64064,136,00065,367,0002,113,536
4Jul 4, 2026 00:0515,724139,913,98965,174,00065,342,0002,113,536
5Jul 4, 2026 00:0515,801140,548,37665,742,00065,411,0002,113,536
6Jul 4, 2026 00:0515,809140,620,53564,883,00066,336,0002,113,536
7Jul 4, 2026 00:0515,855140,914,38565,829,00065,770,0002,113,536
8Jul 4, 2026 00:0515,856140,958,85765,927,00065,684,0002,113,536
9Jul 4, 2026 00:0515,906141,351,36465,055,00066,965,0002,113,536