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 01:35Taylor DettlingTaylor DettlingScore: 10,253Success
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:3510,227101,425,37882,894,0001,997,0002,371,584
2Apr 22, 2026 01:3510,243102,029,15582,020,0003,000,0002,375,680
3Apr 22, 2026 01:3510,244102,858,38881,032,0004,001,0002,433,024
4Apr 22, 2026 01:3510,246104,771,86781,045,0004,002,0002,347,008
5Apr 22, 2026 01:3510,253102,468,89280,102,0005,006,0002,367,488
6Apr 22, 2026 01:3510,291104,808,28482,408,0003,014,0002,457,600
7Apr 22, 2026 01:3510,32899,182,16083,731,0001,993,0002,375,680
8Apr 22, 2026 01:3510,337104,387,94982,812,0002,993,0002,371,584
9Apr 22, 2026 01:3510,346106,366,60782,881,0002,995,0002,379,776