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 listAug 6, 2026 00:39TonyTonyScore: 7,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 00:397,92375,609,79563,087,0002,676,0002,113,536
2Aug 6, 2026 00:397,92875,651,85863,201,0002,602,0002,113,536
3Aug 6, 2026 00:397,93975,704,09763,251,0002,647,0002,113,536
4Aug 6, 2026 00:397,94675,745,15063,307,0002,653,0002,113,536
5Aug 6, 2026 00:397,96075,953,14363,367,0002,709,0002,113,536
6Aug 6, 2026 00:397,96075,884,95863,386,0002,686,0002,113,536
7Aug 6, 2026 00:397,96175,913,93163,389,0002,690,0002,113,536
8Aug 6, 2026 00:397,98676,120,15763,611,0002,681,0002,113,536
9Aug 6, 2026 00:397,99076,146,71363,619,0002,702,0002,113,536