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 18, 2026 00:38avoidcatenjoyersavoidcatenjoyersScore: 93,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 00:3893,488788,237,436718,098,00057,854,0002,113,536
2May 18, 2026 00:3893,509785,550,818717,791,00058,334,0002,113,536
3May 18, 2026 00:3893,549786,988,367718,163,00058,296,0002,113,536
4May 18, 2026 00:3893,625788,479,085718,587,00058,505,0002,113,536
5May 18, 2026 00:3893,664794,428,984717,675,00059,742,0002,113,536
6May 18, 2026 00:3893,682787,771,510719,114,00058,454,0002,113,536
7May 18, 2026 00:3893,729788,245,324719,506,00058,445,0002,113,536
8May 18, 2026 00:3893,760787,604,179720,031,00058,177,0002,113,536
9May 18, 2026 00:3893,773787,796,307720,005,00058,319,0002,113,536