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 29, 2026 14:31Danylo MocherniukDanylo MocherniukScore: 12,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 14:3112,117130,998,652100,570,00002,297,856
2Mar 29, 2026 14:3112,125136,249,87199,632,0001,006,0002,506,752
3Mar 29, 2026 14:3112,128134,091,824100,661,00002,297,856
4Mar 29, 2026 14:3112,140129,681,48698,767,0001,995,0002,363,392
5Mar 29, 2026 14:3112,141125,779,50899,770,000997,0002,297,856
6Mar 29, 2026 14:3112,141130,913,33298,774,0001,995,0002,498,560
7Mar 29, 2026 14:3112,209123,952,32599,330,0002,006,0002,297,856
8Mar 29, 2026 14:3112,231127,809,340101,514,00002,297,856
9Mar 29, 2026 14:3112,336125,076,125101,385,0001,003,0002,510,848