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 listApr 19, 2026 01:48wnwnScore: 56,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 01:4856,823497,552,374469,630,0001,998,0002,289,664
2Apr 19, 2026 01:4856,825497,998,931469,651,0001,998,0002,289,664
3Apr 19, 2026 01:4856,846494,535,234470,823,000999,0002,273,280