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 16, 2026 10:00Hung T.NguyenHung T.NguyenScore: 39,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 10:0039,635355,257,715327,971,000999,0002,269,184
2Mar 16, 2026 10:0039,705360,483,586324,556,0004,993,0002,392,064
3Mar 16, 2026 10:0039,712357,781,964327,613,0001,997,0002,265,088
4Mar 16, 2026 10:0039,723352,999,948326,702,0002,997,0002,265,088
5Mar 16, 2026 10:0039,725359,279,123326,717,0002,997,0002,265,088
6Mar 16, 2026 10:0039,725356,655,855328,718,000999,0002,265,088
7Mar 16, 2026 10:0039,731355,160,832327,766,0001,998,0002,400,256
8Mar 16, 2026 10:0039,743356,287,158326,868,0002,998,0002,400,256
9Mar 16, 2026 10:0039,752356,303,970327,939,0001,999,0002,265,088