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 listAug 25, 2026 14:17Victor MerckléVictor MerckléScore: 4,429Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 14:194,38444,722,40935,358,0001,031,0002,117,632stderr
2Aug 25, 2026 14:194,39844,872,11635,498,0001,008,0002,117,632stderr
3Aug 25, 2026 14:194,41144,994,07735,602,0001,016,0002,117,632stderr
4Aug 25, 2026 14:194,41945,432,31935,642,0001,041,0002,117,632stderr
5Aug 25, 2026 14:194,42945,150,50735,734,0001,031,0002,117,632stderr
6Aug 25, 2026 14:194,44245,252,08935,843,0001,031,0002,117,632stderr
7Aug 25, 2026 14:194,59547,721,17237,131,0001,014,0002,117,632stderr
8Aug 25, 2026 14:194,65346,997,17237,611,0001,016,0002,117,632stderr
9Aug 25, 2026 14:194,72048,493,97338,111,0001,068,0002,117,632stderr