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 listMay 18, 2026 09:39Victor MerckléVictor MerckléScore: 7,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 09:397,74372,334,26563,209,0001,065,0002,113,536
2May 18, 2026 09:397,74472,534,83763,251,0001,028,0002,113,536
3May 18, 2026 09:397,74773,843,03863,245,0001,063,0002,113,536
4May 18, 2026 09:397,74872,147,09163,252,0001,063,0002,113,536
5May 18, 2026 09:397,74973,883,64963,262,0001,057,0002,113,536
6May 18, 2026 09:397,75072,556,24563,272,0001,057,0002,113,536
7May 18, 2026 09:397,75374,258,37263,295,0001,055,0002,113,536
8May 18, 2026 09:397,77574,120,91363,511,0001,024,0002,113,536
9May 18, 2026 09:397,78175,338,86063,525,0001,058,0002,113,536