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 listDec 9, 2025 10:46Gunsoo KimGunsoo KimScore: 104,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 10:46104,485891,874,380807,209,00060,015,0002,281,472
2Dec 9, 2025 10:46104,500893,320,591807,396,00059,955,0002,285,568
3Dec 9, 2025 10:46104,526889,220,653812,597,00054,972,0002,396,160
4Dec 9, 2025 10:46104,527889,279,689808,607,00058,971,0002,289,664
5Dec 9, 2025 10:46104,534895,781,184810,660,00056,976,0002,387,968
6Dec 9, 2025 10:46104,623896,543,267808,416,00059,956,0002,285,568
7Dec 9, 2025 10:46104,639893,028,705809,538,00058,966,0002,289,664
8Dec 9, 2025 10:46104,684894,520,720809,888,00058,991,0002,281,472
9Dec 9, 2025 10:46104,704889,189,743807,044,00062,003,0002,281,472