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 listMar 13, 2026 10:08Hung T.NguyenHung T.NguyenScore: 53,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 10:0853,126464,486,319439,950,000999,0002,523,136
2Mar 13, 2026 10:0853,135462,940,996440,017,0001,000,0002,433,024
3Mar 13, 2026 10:0853,155460,252,251440,188,0001,000,0002,527,232
4Mar 13, 2026 10:0853,158466,869,680441,215,00002,281,472
5Mar 13, 2026 10:0853,158463,653,588441,214,00002,527,232
6Mar 13, 2026 10:0853,161468,750,143439,243,0001,996,0002,281,472
7Mar 13, 2026 10:0853,164466,773,745439,264,0002,001,0002,527,232
8Mar 13, 2026 10:0853,167473,331,118440,285,0001,000,0002,527,232
9Mar 13, 2026 10:0853,168470,869,816439,295,0002,001,0002,260,992