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 15, 2026 14:30shartgepettoshartgepettoScore: 14,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 14:3013,948143,302,404111,775,0003,991,0002,519,040
2Mar 15, 2026 14:3014,002141,763,525111,208,0005,009,0002,273,280
3Mar 15, 2026 14:3014,009145,612,986112,262,0004,009,0002,412,544
4Mar 15, 2026 14:3014,027142,770,555114,413,0002,007,0002,412,544
5Mar 15, 2026 14:3014,049143,961,667113,591,0003,015,0002,412,544
6Mar 15, 2026 14:3014,049142,761,149111,582,0005,026,0002,269,184
7Mar 15, 2026 14:3014,073144,055,594113,809,0002,994,0002,412,544
8Mar 15, 2026 14:3014,111143,536,424113,121,0004,004,0002,412,544
9Mar 15, 2026 14:3014,151138,545,098114,440,0003,011,0002,269,184