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 25, 2026 20:52Maya RebholzMaya RebholzError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 21:49Adam Folwarczny10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 21:52030,467,618,1921,381,177,0005,639,156,00024,576Killed by timeout
2May 25, 2026 20:525,85659,442,66343,208,0005,397,0002,113,536
3May 25, 2026 20:525,87860,817,15243,308,0005,486,0002,113,536
4May 25, 2026 20:525,87960,342,94643,187,0005,612,0002,117,632
5May 25, 2026 20:525,88358,717,55043,320,0005,514,0002,117,632
6May 25, 2026 20:525,89759,286,63543,423,0005,524,0002,113,536
7May 25, 2026 20:525,93759,892,89843,627,0005,657,0002,113,536
8May 25, 2026 20:525,96060,698,78944,023,0005,445,0002,117,632
9May 25, 2026 20:525,96260,963,34343,911,0005,577,0002,113,536
10May 25, 2026 20:525,97162,557,67344,121,0005,439,0002,117,632