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 21, 2026 13:39Daniel MastalerzDaniel MastalerzScore: 5,761Success
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 13:395,72475,836,28044,481,0003,032,0002,523,136
2Feb 21, 2026 13:395,72975,120,77845,529,0002,023,0002,273,280
3Feb 21, 2026 13:395,73673,936,11644,570,0003,038,0002,273,280
4Feb 21, 2026 13:395,75679,975,34643,796,0003,981,0002,326,528
5Feb 21, 2026 13:395,75971,821,19845,810,0001,991,0002,514,944
6Feb 21, 2026 13:395,76172,934,07245,827,0001,992,0002,326,528
7Feb 21, 2026 13:395,76175,556,83744,831,0002,988,0002,514,944
8Feb 21, 2026 13:395,77274,254,38044,910,0002,994,0002,285,568
9Feb 21, 2026 13:395,82675,474,07844,324,0004,029,0002,318,336
10Feb 21, 2026 13:395,85373,335,07346,552,0002,024,0002,260,992
11Feb 21, 2026 13:395,85977,220,79245,590,0003,039,0002,379,776
12Feb 21, 2026 13:396,09789,182,18846,555,0004,048,0002,281,472