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:51poyo180605poyo180605Score: 68,053Success
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:5167,975589,794,062492,165,00072,024,0002,523,136
2Mar 26, 2026 05:5168,014589,164,825483,589,00080,931,0002,289,664
3Mar 26, 2026 05:5168,019587,127,058502,493,00062,061,0002,289,664
4Mar 26, 2026 05:5168,050590,305,577498,836,00065,978,0002,289,664
5Mar 26, 2026 05:5168,053593,006,255506,855,00057,983,0002,523,136
6Mar 26, 2026 05:5168,074590,036,912506,011,00059,001,0002,289,664
7Mar 26, 2026 05:5168,120592,307,657499,469,00065,929,0002,281,472
8Mar 26, 2026 05:5168,162589,843,039496,777,00068,969,0002,519,040
9Mar 26, 2026 05:5168,619593,555,882481,610,00087,928,0002,289,664