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 listAug 2, 2026 18:59George SeabridgeGeorge SeabridgeScore: 14,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 18:5913,372120,971,937108,800,0002,195,0002,113,536
2Aug 2, 2026 18:5913,465121,781,371109,482,0002,280,0002,113,536
3Aug 2, 2026 18:5914,104126,992,699114,851,0002,218,0002,113,536
4Aug 2, 2026 18:5914,383130,055,707117,206,0002,178,0002,113,536
5Aug 2, 2026 18:5914,575130,933,421118,763,0002,217,0002,113,536
6Aug 2, 2026 18:5914,584131,029,400118,794,0002,256,0002,113,536
7Aug 2, 2026 18:5915,104135,367,398123,086,0002,279,0002,113,536
8Aug 2, 2026 18:5915,416137,881,772125,728,0002,227,0002,113,536
9Aug 2, 2026 18:5915,917142,809,446129,817,0002,298,0002,113,536