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:03poyo180605poyo180605Score: 60,436Success
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:0360,307521,796,666446,598,00053,951,0002,457,600
2Mar 26, 2026 06:0360,331524,752,376458,769,00041,978,0002,445,312
3Mar 26, 2026 06:0360,393526,471,862440,355,00060,910,0002,461,696
4Mar 26, 2026 06:0360,431528,298,240476,600,00024,979,0002,457,600
5Mar 26, 2026 06:0360,436531,750,822483,631,00017,986,0002,453,504
6Mar 26, 2026 06:0360,453526,909,828430,798,00070,966,0002,441,216
7Mar 26, 2026 06:0360,479527,047,496474,981,00026,998,0002,461,696
8Mar 26, 2026 06:0360,524527,231,854467,322,00035,024,0002,461,696
9Mar 26, 2026 06:0360,530532,153,397432,347,00070,056,0002,293,760