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 listMar 29, 2026 21:31Danylo MocherniukDanylo MocherniukScore: 6,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 21:316,57378,415,49953,545,0001,010,0002,347,008
2Mar 29, 2026 21:316,58687,601,05853,653,0001,012,0002,506,752
3Mar 29, 2026 21:316,60785,762,02153,838,000997,0002,502,656
4Mar 29, 2026 21:316,60785,014,21453,844,000997,0002,293,760
5Mar 29, 2026 21:316,61477,787,79052,897,0001,996,0002,506,752
6Mar 29, 2026 21:316,61679,921,22652,915,0001,996,0002,293,760
7Mar 29, 2026 21:316,62077,025,04153,951,000999,0002,510,848
8Mar 29, 2026 21:316,63176,367,30253,038,0002,001,0002,289,664
9Mar 29, 2026 21:316,64078,575,42954,107,0001,001,0002,510,848