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 2, 2024 02:13wnwnScore: 1,662,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2024 02:131,646,13813,720,225,94413,662,944,59502,273,280
2Mar 2, 2024 02:131,662,50313,862,094,98513,798,775,78402,252,800
3Mar 2, 2024 02:131,700,82514,180,335,42914,116,844,77802,265,088