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 listJun 8, 2026 12:05chereshnya123chereshnya123Score: 58,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 12:0558,490494,454,651427,496,00057,974,0002,113,536
2Jun 8, 2026 12:0558,491494,550,147427,552,00057,929,0002,113,536
3Jun 8, 2026 12:0558,506494,721,368427,602,00058,002,0002,113,536
4Jun 8, 2026 12:0558,530494,828,806427,399,00058,402,0002,113,536
5Jun 8, 2026 12:0558,544503,093,544427,903,00058,019,0002,113,536
6Jun 8, 2026 12:0558,551495,056,580427,376,00058,600,0002,113,536
7Jun 8, 2026 12:0558,582495,259,832427,612,00058,621,0002,113,536
8Jun 8, 2026 12:0558,625498,841,200427,223,00059,369,0002,113,536
9Jun 8, 2026 12:0558,728502,507,406427,824,00059,619,0002,113,536