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 19, 2025 15:34Brandon TangBrandon TangScore: 55,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2025 15:3455,050483,448,318453,918,0002,999,0002,453,504
2Mar 19, 2025 15:3455,051483,621,425454,928,0001,999,0002,449,408
3Mar 19, 2025 15:3455,057485,936,438453,974,0002,999,0002,457,600