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 26, 2026 05:42poyo180605poyo180605Score: 83,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 05:4283,128712,036,267612,969,00076,996,0002,289,664
2Mar 26, 2026 05:4283,133717,358,922627,001,00063,000,0002,519,040
3Mar 26, 2026 05:4283,153714,560,477632,160,00058,014,0002,265,088
4Mar 26, 2026 05:4283,158713,961,995630,196,00060,018,0002,523,136
5Mar 26, 2026 05:4283,216716,736,472632,716,00057,974,0002,281,472
6Mar 26, 2026 05:4283,274719,854,448620,160,00071,018,0002,519,040
7Mar 26, 2026 05:4283,279717,354,997623,196,00068,021,0002,281,472
8Mar 26, 2026 05:4283,429717,243,196623,513,00068,946,0002,510,848
9Mar 26, 2026 05:4283,457719,350,688622,724,00069,968,0002,367,488