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 06:01poyo180605poyo180605Score: 64,403Success
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 06:0164,289557,592,185468,651,00064,951,0002,506,752
2Mar 26, 2026 06:0164,370562,065,253480,245,00054,027,0002,506,752
3Mar 26, 2026 06:0164,385561,570,224473,464,00060,931,0002,285,568
4Mar 26, 2026 06:0164,393564,696,493472,526,00061,937,0002,347,008
5Mar 26, 2026 06:0164,403561,353,031461,611,00072,938,0002,293,760
6Mar 26, 2026 06:0164,441561,614,038467,880,00066,982,0002,510,848
7Mar 26, 2026 06:0164,502563,224,401476,323,00059,040,0002,293,760
8Mar 26, 2026 06:0164,546561,904,864480,758,00054,972,0002,506,752
9Mar 26, 2026 06:0164,566563,592,856473,908,00061,988,0002,502,656