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 17, 2026 17:09user76135user76135Score: 245,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 17:09245,0242,045,938,9281,969,626,00064,076,0002,113,536
2May 17, 2026 17:09245,0252,044,300,4951,969,628,00064,086,0002,113,536
3May 17, 2026 17:09245,0822,045,434,4081,970,096,00064,086,0002,113,536
4May 17, 2026 17:09245,0982,043,853,1381,970,232,00064,087,0002,113,536
5May 17, 2026 17:09245,1302,044,233,8291,969,506,00065,081,0002,113,536
6May 17, 2026 17:09245,2232,046,548,5651,970,258,00065,093,0002,113,536
7May 17, 2026 17:09245,2632,046,974,9301,971,593,00064,094,0002,113,536
8May 17, 2026 17:09245,2922,046,091,2551,968,848,00067,082,0002,113,536
9May 17, 2026 17:09245,3362,045,597,3681,971,211,00065,083,0002,113,536