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 20, 2026 23:07Josu San MartinJosu San MartinScore: 6,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 00:455,94669,607,91048,343,0001,007,0002,523,136
2Feb 21, 2026 00:456,02570,318,60548,010,0002,000,0002,433,024
3Feb 21, 2026 00:456,03170,108,24048,056,0002,002,0002,260,992
4Feb 21, 2026 00:456,03773,530,04648,107,0002,004,0002,437,120
5Feb 20, 2026 23:076,05875,489,21248,269,0002,011,0002,289,664
6Feb 21, 2026 00:456,15173,479,47249,054,0002,002,0002,281,472
7Feb 20, 2026 23:076,18077,556,18550,290,0001,005,0002,523,136
8Feb 20, 2026 23:076,19273,559,27250,383,0001,007,0002,273,280
9Feb 20, 2026 23:076,24571,726,55748,842,0002,990,0002,273,280
10Feb 21, 2026 00:456,27879,849,16850,104,0002,004,0002,289,664
11Feb 20, 2026 23:076,32273,519,21851,466,0001,009,0002,437,120
12Feb 20, 2026 23:076,36479,943,68051,822,000996,0002,433,024