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 22:06Josu San MartinJosu San MartinScore: 7,443Success
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 22:077,39170,670,41459,294,0002,055,0002,113,536
2Jul 3, 2026 22:077,41970,933,87058,546,0003,032,0002,113,536
3Jul 3, 2026 22:077,42771,034,60059,616,0002,036,0002,113,536
4Jul 3, 2026 22:077,43471,022,93759,672,0002,038,0002,113,536
5Jul 3, 2026 22:077,44371,046,89159,743,0002,040,0002,113,536
6Jul 3, 2026 22:077,46671,258,93658,910,0003,058,0002,113,536
7Jul 3, 2026 22:077,47271,310,50059,974,0002,046,0002,113,536
8Jul 3, 2026 22:077,49871,618,73560,193,0002,043,0002,113,536
9Jul 3, 2026 22:077,56372,137,74360,713,0002,065,0002,113,536