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 11, 2026 15:47wnwnScore: 3,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:483,27936,004,05127,222,00002,113,536
2May 11, 2026 15:483,28836,481,89327,293,00002,113,536
3May 11, 2026 15:483,29634,562,24427,365,00002,113,536
4May 11, 2026 15:483,30535,620,29627,435,00002,113,536
5May 11, 2026 15:483,31035,634,62927,476,00002,113,536
6May 11, 2026 15:483,35237,006,90227,823,00002,113,536
7May 11, 2026 15:483,41135,890,08327,312,0001,003,0002,113,536
8May 11, 2026 15:483,43339,271,50428,502,00002,113,536
9May 11, 2026 15:483,48539,001,03827,924,0001,007,0002,113,536