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 21:02Josu San MartinJosu San MartinScore: 6,442Success
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 21:036,35262,017,62648,575,0004,147,0002,113,536
2Jul 3, 2026 21:036,38562,365,11848,804,0004,195,0002,113,536
3Jul 3, 2026 21:036,39662,414,62748,870,0004,225,0002,113,536
4Jul 3, 2026 21:036,42762,690,09149,154,0004,197,0002,113,536
5Jul 3, 2026 21:036,44262,830,63849,175,0004,301,0002,113,536
6Jul 3, 2026 21:036,45262,962,66749,309,0004,249,0002,113,536
7Jul 3, 2026 21:036,45464,193,78249,326,0004,243,0002,113,536
8Jul 3, 2026 21:036,51563,493,42049,706,0004,375,0002,113,536
9Jul 3, 2026 21:036,52863,493,68749,952,0004,237,0002,113,536