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 listApr 13, 2026 18:53Yuriy LyfenkoYuriy LyfenkoScore: 4,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 18:534,28960,504,34334,581,0001,017,0002,535,424
2Apr 13, 2026 18:534,29163,238,47434,595,0001,017,0002,469,888
3Apr 13, 2026 18:534,29161,627,96934,602,0001,017,0002,306,048
4Apr 13, 2026 18:534,29264,857,85834,607,0001,017,0002,478,080
5Apr 13, 2026 18:534,31666,494,59333,831,0001,990,0002,469,888
6Apr 13, 2026 18:534,31763,973,53933,841,0001,990,0002,461,696
7Apr 13, 2026 18:534,31762,978,38833,842,0001,990,0002,535,424
8Apr 13, 2026 18:534,31861,560,19233,848,0001,991,0002,482,176
9Apr 13, 2026 18:534,34363,629,14835,043,0001,001,0002,293,760