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 02:27avoidcatenjoyersavoidcatenjoyersScore: 74,026Success
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 02:2773,943624,809,830554,826,00058,901,0002,117,632
2May 18, 2026 02:2773,943623,599,807555,338,00058,396,0002,113,536
3May 18, 2026 02:2773,945627,799,481554,816,00058,931,0002,113,536
4May 18, 2026 02:2774,010625,804,041554,715,00059,574,0002,113,536
5May 18, 2026 02:2774,026624,012,056555,640,00058,778,0002,113,536
6May 18, 2026 02:2774,043624,565,745556,171,00058,390,0002,113,536
7May 18, 2026 02:2774,047624,920,799555,824,00058,769,0002,113,536
8May 18, 2026 02:2774,110626,159,629556,737,00058,378,0002,113,536
9May 18, 2026 02:2774,116624,547,400556,297,00058,872,0002,113,536