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 listMar 18, 2025 02:23tch1001tch1001Score: 1,826,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2025 02:231,824,51015,175,927,25315,065,470,00077,966,0002,277,376
2Mar 18, 2025 02:231,824,60115,172,567,59015,095,205,00048,981,0002,277,376
3Mar 18, 2025 02:231,825,77515,184,200,73215,087,959,00065,973,0002,289,664
4Mar 18, 2025 02:231,825,95215,187,362,11415,097,424,00057,974,0002,277,376
5Mar 18, 2025 02:231,826,31615,194,035,02415,081,465,00076,961,0002,289,664
6Mar 18, 2025 02:231,826,46115,185,059,37515,087,658,00071,969,0002,289,664
7Mar 18, 2025 02:231,829,05315,214,070,63715,104,176,00076,965,0002,277,376
8Mar 18, 2025 02:231,829,59015,217,182,68815,109,639,00075,962,0002,277,376
9Mar 18, 2025 02:231,830,40615,224,606,06315,124,399,00067,974,0002,277,376