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 listOct 27, 2025 01:53Weitao WanWeitao WanScore: 150,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 01:53150,4141,276,173,5581,187,468,00060,972,0002,285,568
2Oct 27, 2025 01:53150,5041,276,996,8551,182,227,00066,956,0002,285,568
3Oct 27, 2025 01:53150,5221,277,866,4551,191,362,00057,968,0002,260,992
4Oct 27, 2025 01:53150,5301,276,867,9811,183,433,00065,968,0002,260,992
5Oct 27, 2025 01:53150,5341,278,789,8611,183,463,00065,970,0002,277,376
6Oct 27, 2025 01:53150,5381,276,372,9751,184,491,00064,972,0002,519,040
7Oct 27, 2025 01:53150,5381,276,690,9071,168,499,00080,965,0002,265,088
8Oct 27, 2025 01:53150,6281,272,808,3731,195,248,00054,965,0002,285,568
9Oct 27, 2025 01:53150,6491,278,727,4041,176,427,00073,963,0002,269,184