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 2, 2025 10:33PhibPhibScore: 35,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2025 10:3335,414317,916,340290,935,0002,999,0002,281,472
2Mar 2, 2025 10:3335,442317,644,085292,171,0002,001,0002,506,752
3Mar 2, 2025 10:3335,480324,772,023294,488,00002,510,848
4Mar 2, 2025 10:3335,490324,191,307291,559,0003,005,0002,281,472
5Mar 2, 2025 10:3335,493327,192,656292,590,0002,004,0002,510,848
6Mar 2, 2025 10:3335,505319,901,635293,695,000998,0002,506,752
7Mar 2, 2025 10:3335,510319,902,296291,739,0002,997,0002,281,472
8Mar 2, 2025 10:3335,540317,693,982292,979,0001,999,0002,510,848
9Mar 2, 2025 10:3335,550321,851,120293,067,0002,000,0002,281,472