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 10, 2026 15:22Danylo MocherniukDanylo MocherniukScore: 4,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 15:224,53161,313,83734,555,0003,049,0002,326,528
2Apr 10, 2026 15:214,55962,295,93237,839,00002,297,856
3Apr 10, 2026 15:224,58263,674,74135,025,0003,002,0002,498,560
4Apr 10, 2026 15:224,64368,770,41335,498,0003,042,0002,510,848
5Apr 10, 2026 15:224,64367,016,50536,513,0002,028,0002,297,856
6Apr 10, 2026 15:224,67864,808,37236,835,0001,991,0002,387,968
7Apr 10, 2026 15:214,70564,038,45836,048,0003,004,0002,523,136
8Apr 10, 2026 15:224,71663,148,00937,135,0002,007,0002,383,872
9Apr 10, 2026 15:224,71863,067,27837,148,0002,008,0002,297,856
10Apr 10, 2026 15:224,82964,383,69637,078,0003,006,0002,297,856
11Apr 10, 2026 15:224,83466,326,89637,114,0003,009,0002,297,856
12Apr 10, 2026 15:214,93167,254,69839,927,000998,0002,387,968