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 listSep 16, 2026 23:39Andrew EpsteinAndrew EpsteinScore: 228,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 23:40227,9431,902,160,5521,890,929,0001,001,0002,117,632stderr
2Sep 16, 2026 23:40227,9671,902,513,8101,889,991,0002,140,0002,117,632stderr
3Sep 16, 2026 23:40227,9781,902,421,2861,891,221,0001,002,0002,117,632stderr
4Sep 16, 2026 23:40228,2031,904,372,7491,893,085,0001,006,0002,117,632stderr
5Sep 16, 2026 23:40228,3591,905,674,5931,894,381,0001,002,0002,117,632stderr
6Sep 16, 2026 23:40228,5041,907,156,7761,894,436,0002,148,0002,117,632stderr
7Sep 16, 2026 23:40228,5461,907,226,1631,895,928,0001,005,0002,117,632stderr
8Sep 16, 2026 23:40228,6151,908,023,9281,896,488,0001,019,0002,117,632stderr
9Sep 16, 2026 23:40228,9791,910,819,6291,898,500,0002,029,0002,117,632stderr