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 24, 2026 22:42janwwwjanwwwScore: 6,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 22:426,37563,230,98050,796,0002,124,0002,113,536
2Sep 24, 2026 22:426,40363,395,22450,954,0002,191,0002,113,536
3Sep 24, 2026 22:426,40463,398,55651,013,0002,146,0002,113,536
4Sep 24, 2026 22:426,42463,562,15551,127,0002,196,0002,113,536
5Sep 24, 2026 22:426,45263,854,21451,365,0002,188,0002,113,536
6Sep 24, 2026 22:426,46063,993,62951,421,0002,202,0002,113,536
7Sep 24, 2026 22:426,47065,127,50151,580,0002,122,0002,113,536
8Sep 24, 2026 22:426,51864,351,92451,887,0002,215,0002,113,536
9Sep 24, 2026 22:426,72466,007,36453,699,0002,113,0002,113,536