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 listJun 18, 2025 16:14Andy BlairAndy BlairScore: 196,762Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2025 16:14196,5061,663,159,8741,529,062,000101,937,0002,318,336
2Jun 18, 2025 16:14196,5181,662,569,9461,541,152,00089,950,0002,322,432
3Jun 18, 2025 16:14196,6601,660,267,0181,535,323,00096,957,0002,322,432
4Jun 18, 2025 16:14196,6841,654,407,8291,527,515,000104,966,0002,473,984
5Jun 18, 2025 16:14196,7621,662,318,9301,528,181,000104,943,0002,469,888
6Jun 18, 2025 16:14197,0041,665,839,3441,538,182,00096,948,0002,330,624
7Jun 18, 2025 16:14197,0181,662,915,5451,542,290,00092,957,0002,322,432
8Jun 18, 2025 16:14197,1331,663,646,7271,539,253,00096,953,0002,322,432
9Jun 18, 2025 16:14197,2691,662,878,1501,539,371,00097,960,0002,322,432