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 29, 2026 08:46Danylo MocherniukDanylo MocherniukScore: 56,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 08:4655,947487,779,046462,363,0001,997,0002,506,752
2Mar 29, 2026 08:4655,990486,447,730462,721,0001,998,0002,281,472
3Mar 29, 2026 08:4656,014488,130,377462,917,0001,999,0002,281,472
4Mar 29, 2026 08:4656,028489,624,234464,035,0001,000,0002,510,848
5Mar 29, 2026 08:4656,032493,940,325463,069,0002,000,0002,506,752
6Mar 29, 2026 08:4656,035488,104,110461,094,0004,000,0002,281,472
7Mar 29, 2026 08:4656,038491,718,308463,116,0002,000,0002,281,472
8Mar 29, 2026 08:4656,050504,613,827463,214,0002,000,0002,281,472
9Mar 29, 2026 08:4656,059493,598,841464,287,0001,000,0002,506,752