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 27, 2025 16:13Josu San MartinJosu San MartinScore: 32,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 16:1332,596301,520,639270,546,00002,289,664
2Dec 27, 2025 16:1332,628301,043,578268,811,0001,998,0002,289,664
3Dec 27, 2025 16:1332,637295,997,685268,884,0001,999,0002,289,664
4Dec 27, 2025 16:1332,650298,392,177268,995,0001,999,0002,355,200
5Dec 27, 2025 16:1332,671298,108,391270,166,0001,000,0002,289,664
6Dec 27, 2025 16:1332,686299,835,314271,296,00002,289,664
7Dec 27, 2025 16:1332,693300,881,351271,354,00002,351,104
8Dec 27, 2025 16:1332,753298,870,925269,852,0001,998,0002,289,664
9Dec 27, 2025 16:1332,768300,605,884269,974,0001,999,0002,363,392