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 listJan 16, 2025 11:04ttmxttmxScore: 528,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 11:04524,8344,388,935,4354,281,158,00074,967,0002,269,184
2Jan 16, 2025 11:04525,6484,387,860,7694,297,908,00064,968,0002,289,664
3Jan 16, 2025 11:04528,1554,422,327,4454,319,710,00063,980,0002,273,280
4Jan 16, 2025 11:04528,3304,418,244,1094,313,187,00071,953,0002,289,664
5Jan 16, 2025 11:04528,6274,417,150,8864,301,652,00085,953,0002,289,664
6Jan 16, 2025 11:04529,2344,415,763,7934,317,684,00074,959,0002,269,184
7Jan 16, 2025 11:04529,3484,419,731,5974,312,633,00080,955,0002,523,136
8Jan 16, 2025 11:04530,5644,432,710,7284,329,718,00073,961,0002,289,664
9Jan 16, 2025 11:04541,2544,519,536,0934,428,442,00063,963,0002,277,376