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 1, 2026 16:37Hung T.NguyenHung T.NguyenScore: 70,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 16:3770,575601,631,082584,778,0001,001,0002,379,776
2May 1, 2026 16:3770,579601,916,513583,814,0001,999,0002,310,144
3May 1, 2026 16:3770,590605,021,189584,903,000999,0002,318,336
4May 1, 2026 16:3770,597607,099,645584,962,000999,0002,379,776
5May 1, 2026 16:3770,606606,634,002586,030,00002,322,432
6May 1, 2026 16:3770,651606,129,323584,408,0001,997,0002,387,968
7May 1, 2026 16:3770,655604,086,776584,443,0001,998,0002,310,144
8May 1, 2026 16:3770,719601,221,973584,975,0001,999,0002,326,528
9May 1, 2026 16:3770,744607,044,113585,180,0002,000,0002,379,776