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 18, 2025 02:40Elnur RakhmatullinElnur RakhmatullinScore: 36,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2025 02:4035,959324,846,013297,458,0001,001,0002,519,040
2Sep 18, 2025 02:4035,983324,712,742296,661,0001,997,0002,277,376
3Sep 18, 2025 02:4036,045322,770,910295,170,0004,002,0002,277,376
4Sep 18, 2025 02:4036,072326,373,808297,398,0002,002,0002,277,376
5Sep 18, 2025 02:4036,073327,574,471297,407,0002,002,0002,371,584
6Sep 18, 2025 02:4036,118327,947,723296,780,0002,997,0002,277,376
7Sep 18, 2025 02:4036,295325,231,787299,248,0002,001,0002,277,376
8Sep 18, 2025 02:4036,324326,682,948299,483,0002,003,0002,273,280
9Sep 18, 2025 02:4036,329329,674,260300,532,0001,001,0002,273,280