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 listAug 19, 2026 07:33Lan Hoang DaoLan Hoang DaoScore: 93,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 07:3493,391786,053,278716,540,00058,609,0002,113,536
2Aug 19, 2026 07:3493,426786,282,254716,749,00058,692,0002,113,536
3Aug 19, 2026 07:3493,453785,840,122717,316,00058,350,0002,113,536
4Aug 19, 2026 07:3493,524786,299,857717,712,00058,541,0002,113,536
5Aug 19, 2026 07:3493,567786,749,151717,245,00059,363,0002,113,536
6Aug 19, 2026 07:3493,574786,833,390718,173,00058,499,0002,113,536
7Aug 19, 2026 07:3493,578786,794,229718,507,00058,193,0002,113,536
8Aug 19, 2026 07:3493,635787,951,492717,915,00059,263,0002,113,536
9Aug 19, 2026 07:3496,323809,680,274739,055,00060,429,0002,113,536