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:45poyo180605poyo180605Score: 69,486Success
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:4569,450604,032,680505,504,00070,930,0002,289,664
2Mar 26, 2026 05:4569,454605,551,827505,537,00070,935,0002,289,664
3Mar 26, 2026 05:4569,482602,017,076505,736,00070,963,0002,265,088
4Mar 26, 2026 05:4569,484602,402,551509,753,00066,967,0002,519,040
5Mar 26, 2026 05:4569,486605,255,109513,763,00062,971,0002,265,088
6Mar 26, 2026 05:4569,520598,464,946514,014,00063,001,0002,289,664
7Mar 26, 2026 05:4569,526602,778,105518,061,00059,006,0002,281,472
8Mar 26, 2026 05:4569,530600,466,054511,085,00066,010,0002,281,472
9Mar 26, 2026 05:4569,580605,769,968507,572,00069,941,0002,523,136