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 26, 2026 21:40Victor MerckléVictor MerckléScore: 7,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 21:407,10467,307,09257,947,0001,017,0002,117,632stderr
2Aug 26, 2026 21:407,13468,763,89158,134,0001,080,0002,117,632stderr
3Aug 26, 2026 21:407,14967,663,78558,118,0001,225,0002,117,632stderr
4Aug 26, 2026 21:407,15367,810,17258,294,0001,082,0002,117,632stderr
5Aug 26, 2026 21:407,15367,832,58958,282,0001,094,0002,117,632stderr
6Aug 26, 2026 21:407,15467,776,19658,272,0001,113,0002,117,632stderr
7Aug 26, 2026 21:407,16567,833,16458,433,0001,037,0002,117,632stderr
8Aug 26, 2026 21:407,17168,098,57358,483,0001,039,0002,117,632stderr
9Aug 26, 2026 21:407,21473,548,07958,798,0001,086,0002,117,632stderr