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 listJan 1, 2026 20:17Josu San MartinJosu San MartinScore: 6,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 20:176,28576,601,53249,153,0003,009,0002,396,160
2Jan 1, 2026 20:176,29078,769,97348,191,0004,015,0002,486,272
3Jan 1, 2026 20:176,30771,769,85647,314,0005,033,0002,392,064
4Jan 1, 2026 20:176,58281,724,91653,621,0001,011,0002,330,624
5Jan 1, 2026 20:176,60283,217,42051,808,0002,988,0002,363,392
6Jan 1, 2026 20:176,60676,038,02152,840,0001,993,0002,359,296