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 10, 2026 18:43Lan Hoang DaoLan Hoang DaoScore: 104,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 18:43104,411876,679,032807,319,00059,294,0002,113,536
2Aug 10, 2026 18:43104,523878,290,428808,447,00059,102,0002,113,536
3Aug 10, 2026 18:43104,538877,760,506808,538,00059,130,0002,113,536
4Aug 10, 2026 18:43104,613878,282,253809,159,00059,133,0002,113,536
5Aug 10, 2026 18:43104,721880,039,333809,063,00060,122,0002,113,536
6Aug 10, 2026 18:43104,742879,609,550809,139,00060,225,0002,113,536
7Aug 10, 2026 18:43104,878880,592,045808,325,00062,168,0002,113,536
8Aug 10, 2026 18:43105,268883,829,476809,580,00064,152,0002,113,536
9Aug 10, 2026 18:43105,535886,038,158808,808,00067,139,0002,113,536