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 listApr 22, 2026 00:58Taylor DettlingTaylor DettlingScore: 21,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 01:0020,829191,336,985170,890,0001,998,0002,359,296
2Apr 22, 2026 01:0021,553198,552,454176,894,0001,998,0002,351,104
3Apr 22, 2026 01:0021,563198,309,189176,980,0001,999,0002,363,392
4Apr 22, 2026 01:0021,577196,156,527178,094,0001,000,0002,334,720
5Apr 22, 2026 01:0021,582194,002,446178,131,0001,000,0002,441,216
6Apr 22, 2026 01:0021,591196,709,239178,207,0001,001,0002,367,488
7Apr 22, 2026 01:0021,612195,524,732178,385,0001,002,0002,347,008
8Apr 22, 2026 01:0021,615195,845,320178,408,0001,002,0002,437,120
9Apr 22, 2026 01:0021,619194,187,426177,434,0002,004,0002,424,832