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:55poyo180605poyo180605Score: 65,741Success
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:5565,675572,697,746456,088,00089,017,0002,506,752
2Mar 26, 2026 05:5565,681571,692,296475,131,00070,019,0002,293,760
3Mar 26, 2026 05:5565,727574,394,156473,592,00071,938,0002,293,760
4Mar 26, 2026 05:5565,732575,455,136472,631,00072,943,0002,293,760
5Mar 26, 2026 05:5565,741572,416,748465,701,00079,948,0002,293,760
6Mar 26, 2026 05:5565,757570,064,489478,812,00066,973,0002,519,040
7Mar 26, 2026 05:5565,757570,260,229470,817,00074,970,0002,510,848
8Mar 26, 2026 05:5565,830571,136,416474,335,00072,050,0002,285,568
9Mar 26, 2026 05:5565,876573,246,589472,800,00073,968,0002,502,656