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 15, 2026 16:16shartgepettoshartgepettoScore: 10,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 16:1610,063109,844,45679,498,0004,025,0002,404,352
2Mar 15, 2026 16:1610,094113,649,77279,790,0003,989,0002,449,408
3Mar 15, 2026 16:1610,119107,521,75380,986,0002,999,0002,498,560
4Mar 15, 2026 16:1610,178108,469,95680,454,0004,022,0002,363,392
5Mar 15, 2026 16:1610,282112,187,97381,323,0004,015,0002,465,792
6Mar 15, 2026 16:1610,294107,596,55681,419,0004,020,0002,473,984
7Mar 15, 2026 16:1610,367110,133,74882,041,0004,002,0002,306,048
8Mar 15, 2026 16:1610,386105,537,74181,190,0005,011,0002,355,200
9Mar 15, 2026 16:1610,518111,583,34482,279,0005,017,0002,342,912