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 listApr 13, 2026 02:54Josu San MartinJosu San MartinScore: 5,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 05:364,96162,960,41339,167,0002,008,0002,383,872
2Apr 13, 2026 01:424,96770,230,22739,217,0002,011,0002,285,568
3Apr 13, 2026 01:425,00464,068,93040,519,0001,012,0002,285,568
4Apr 13, 2026 01:455,03966,020,67839,835,0001,991,0002,285,568
5Apr 13, 2026 02:545,08764,206,78240,212,0002,010,0002,285,568
6Apr 13, 2026 01:425,13664,092,81641,611,0001,014,0002,400,256
7Apr 13, 2026 05:365,13671,988,82941,613,0001,014,0002,494,464
8Apr 13, 2026 01:455,22066,275,62242,320,0001,007,0002,285,568
9Apr 13, 2026 05:365,22166,226,30942,330,0001,007,0002,285,568
10Apr 13, 2026 02:545,24463,816,80742,510,0001,012,0002,392,064
11Apr 13, 2026 01:455,28071,466,99041,829,0001,991,0002,392,064
12Apr 13, 2026 02:545,30364,626,07242,012,0002,000,0002,387,968