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 3, 2026 19:58Josu San MartinJosu San MartinScore: 15,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 19:5815,039134,223,866121,334,0003,490,0002,113,536
2Jul 3, 2026 19:5815,058134,291,967121,555,0003,432,0002,113,536
3Jul 3, 2026 19:5815,070134,517,535121,622,0003,463,0002,113,536
4Jul 3, 2026 19:5815,226135,746,803122,957,0003,427,0002,113,536
5Jul 3, 2026 19:5815,284137,475,448123,307,0003,552,0002,113,536
6Jul 3, 2026 19:5815,296136,283,500123,431,0003,530,0002,113,536
7Jul 3, 2026 19:5815,323136,592,130123,697,0003,488,0002,113,536
8Jul 3, 2026 19:5815,386137,062,943124,234,0003,473,0002,113,536
9Jul 3, 2026 19:5815,511138,096,165125,248,0003,499,0002,113,536