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 2, 2026 17:23Josu San MartinJosu San MartinScore: 6,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 17:236,20677,422,65550,523,000990,0002,469,888
2Jan 2, 2026 17:236,32677,491,19151,497,0001,009,0002,355,200
3Jan 2, 2026 17:236,37483,386,45851,904,000998,0002,359,296
4Jan 2, 2026 17:236,43783,807,94453,427,00002,293,760
5Jan 2, 2026 17:236,45584,863,07853,575,00002,367,488
6Jan 2, 2026 17:236,48288,477,44351,808,0001,992,0002,289,664