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 listMay 2, 2025 17:38Gerard SmitGerard SmitScore: 56,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2025 17:3856,738494,341,459468,928,0001,999,0002,301,952
2May 2, 2025 17:3856,763492,837,447468,136,0003,000,0002,314,240
3May 2, 2025 17:3856,771494,112,543470,200,0001,000,0002,396,160
4May 2, 2025 17:3856,772500,167,337470,211,0001,000,0002,318,336
5May 2, 2025 17:3856,775496,999,732469,234,0002,001,0002,396,160
6May 2, 2025 17:3856,790497,368,539469,354,0002,001,0002,387,968
7May 2, 2025 17:3856,796497,684,840469,402,0002,001,0002,301,952
8May 2, 2025 17:3856,879498,115,374470,094,0002,000,0002,314,240
9May 2, 2025 17:3856,916498,043,471470,405,0002,001,0002,396,160