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 listJan 26, 2026 01:59Ryan ZhuRyan ZhuScore: 2,067,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 26, 2026 01:592,064,65017,173,469,86417,075,624,00060,973,0002,281,472
2Jan 26, 2026 01:592,065,53717,178,834,71517,089,983,00053,974,0002,293,760
3Jan 26, 2026 01:592,065,70117,177,325,74017,085,339,00059,976,0002,281,472
4Jan 26, 2026 01:592,067,14317,189,405,51517,082,322,00074,966,0002,289,664
5Jan 26, 2026 01:592,067,48317,194,933,71517,094,144,00065,965,0002,363,392
6Jan 26, 2026 01:592,068,82317,205,809,94017,105,259,00065,970,0002,281,472
7Jan 26, 2026 01:592,069,18417,202,631,33217,109,257,00064,970,0002,281,472
8Jan 26, 2026 01:592,069,58917,212,372,55717,115,622,00061,969,0002,289,664
9Jan 26, 2026 01:592,070,10317,211,105,95017,120,884,00060,974,0002,281,472