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 listFeb 24, 2026 21:23Mikołaj UzarskiMikołaj UzarskiScore: 5,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 21:235,32171,911,10642,158,0002,007,0002,285,568
2Feb 24, 2026 21:235,32669,964,84843,203,0001,004,0002,514,944
3Feb 24, 2026 21:235,32967,225,90542,219,0002,010,0002,494,464
4Feb 24, 2026 21:235,33670,879,55143,279,0001,006,0002,277,376
5Feb 24, 2026 21:235,33668,740,25341,267,0003,019,0002,510,848
6Feb 24, 2026 21:235,33867,377,61843,299,0001,006,0002,506,752
7Feb 24, 2026 21:245,33972,655,32442,300,0002,014,0002,510,848
8Feb 24, 2026 21:235,34568,762,02843,358,0001,008,0002,510,848
9Feb 24, 2026 21:235,34967,052,09542,376,0002,017,0002,498,560
10Feb 24, 2026 21:245,35167,392,96842,398,0002,018,0002,363,392
11Feb 24, 2026 21:245,35178,685,50543,406,0001,009,0002,281,472
12Feb 24, 2026 21:235,41569,521,13343,947,000998,0002,506,752